Evaluation of Monte Carlo Subspace Clustering with OpenSubspace
نویسندگان
چکیده
We present the results of a thorough evaluation of the subspace clustering algorithm SEPC using the OpenSubspace framework. We show that SEPC outperforms competing projected and subspace clustering algorithms on synthetic and some real world data sets. We also show that SEPC can be used to effectively discover clusters with overlapping objects (i.e., subspace clustering).
منابع مشابه
A Framework for Evaluation and Exploration of Clustering Algorithms in Subspaces of High Dimensional Databases
In high dimensional databases, traditional full space clustering methods are known to fail due to the curse of dimensionality. Thus, in recent years, subspace clustering and projected clustering approaches were proposed for clustering in high dimensional spaces. As the area is rather young, few comparative studies on the advantages and disadvantages of the different algorithms exist. Part of th...
متن کاملSubspace MOA: Subspace Stream Clustering Evaluation Using the MOA Framework
Most available static data are becoming more and more highdimensional. Therefore, subspace clustering, which aims at finding clusters not only within the full dimension but also within subgroups of dimensions, has gained a significant importance. Recently, OpenSubspace framework was proposed to evaluate and explorate subspace clustering algorithms in WEKA with a rich body of most state of the a...
متن کاملEvaluation of dose distribution of 12C ion beam in radiotherapy by FLUKA as a Monte Carlo simulation Code
Introduction: Nowadays, the use of heavy ion beams in cancer therapy have been developed worldwide. Materials and Methods: It requires accurate understanding of the complex processes of ion interaction with matter, as it is the calculation the relative dose & range of these ions in matter. In the present study we used FLUKA as a numerical Monte Carlo simula...
متن کاملOn finding the maximum edge biclique in a bipartite graph: a subspace clustering approach
Bipartite graphs have been proven useful in modeling a wide range of relationship networks. Finding the maximum edge biclique within a bipartite graph is a well-known problem in graph theory and data mining, with numerous realworld applications across different domains. We propose a probabilistic algorithm for finding the maximum edge biclique using a Monte Carlo subspace clustering approach. E...
متن کاملLoss of Load Expectation Assessment in Deregulated Power Systems Using Monte Carlo Simulation and Intelligent Systems
Deregulation policy has caused some changes in the concepts of power systems reliability assessment and enhancement. In this paper, generation reliability is considered, and a method for its assessment using intelligent systems is proposed. Also, because of power market and generators’ forced outages stochastic behavior, Monte Carlo Simulation is used for reliability evaluation. Generation r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013